Game Theoretic Approach to Multi-Agent Transportation Problems on Network

In this paper, we consider a network game where players are multi-agent systems (we call them in paper "coalitions") under the condition that trajectories of (coalitions) should (have no common arcs, or have vertices) i. e. must not intersect. same time inside coalition can intersect arcs,or vertices). The last complicates problem, since sets strategies turn out to be mutually dependent. A family Nash equilibrium is constructed and it also shown minimum total (cost) achieved strategy profile equilibrium. cooperative approach solving problem proposed. Also, another mini maximal investigated. We proportional solution Shapley value allocate minimal costs between players. Two approaches for constructing characteristic function been developed.